Finding Open Content in the Library Is Surprisingly Hard

نویسندگان

چکیده

While library discovery systems offer great promise for delivering open access materials, they often fall short. Discovery tools merge multiple records together, and in the process show a preference linking options that are less likely to successfully deliver full text. Third party bringing users missing content, but these not fully supported systems. Library so focused on keeping unauthorized out of restricted content it compromises their ability get into is freely available.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding the Maximum Likelihood Tree is Hard

Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees (Felsenstein, 1981). Finding optimal ML trees appears to be a very hard computational task, but for tractable cases, ML is the method of choice. In particular, algorithms and heuristics for ML take longer to run than algorithms and heuristics for the second major character based criterion, m...

متن کامل

the washback effect of discretepoint vs. integrative tests on the retention of content in knowledge tests

در این پایان نامه تاثیر دو نوع تست جزیی نگر و کلی نگر بر به یادسپاری محتوا ارزیابی شده که نتایج نشان دهندهکارایی تستهای کلی نگر بیشتر از سایر آزمونها است

15 صفحه اول

Finding Large Clique Minors is Hard

We prove that it is NP-complete, given a graph G and a parameter h, to determine whether G contains a complete graph Kh as a minor. Submitted: June 2008 Reviewed: April 2009 Revised: May 2009 Accepted: July 2009 Final: July 2009 Published: July 2008 Article type: Concise paper Communicated by: G. Liotta Research supported in part by NSF grant 0830403 and by the Office of Naval Research under gr...

متن کامل

Finding large degree-anonymous subgraphs is hard

A graph is said to be k-anonymous for an integer k, if for every vertex in the graph there are at least k − 1 other vertices with the same degree. We examine the computational complexity of making a given undirected graph k-anonymous either through at most s vertex deletions or through at most s edge deletions; the corresponding problem variants are denoted by Anonym V-Del and Anonym E-Del. We ...

متن کامل

Metadata and Open Access: Reliably Finding Content and Finding Reliable Content

Metadata and open access publishing continue to be topics of debate and discussion in the popular media, blogs, and listservs. Different points of view exist among librarians, researchers, publishers, and others, and several examples will be presented regarding open access journals and articles and digital data from the perspective of metadata and accessibility. Open access content is the utmos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Serials Review

سال: 2021

ISSN: ['1879-095X', '0098-7913']

DOI: https://doi.org/10.1080/00987913.2021.1936416